A note on robust Nash equilibria with uncertainties
نویسندگان
چکیده
منابع مشابه
A note on robust Nash equilibria in games with uncertainties
In this short note, we investigate extensions of Nash equilibria when players have some uncertainties upon their payoffs mappings, the behavior (or the type, number or any other characteristics) of their opponents. These solutions are qualified either as robust, ambiguous, partially specified or with uncertainty aversion, depending on the context. We provide a simple necessary and sufficient co...
متن کاملA Note on Approximate Nash Equilibria
In view of the intractability of finding a Nash equilibrium, it is important to understand the limits of approximation in this context. A subexponential approximation scheme is known [LMM03], and no approximation better than 1 4 is possible by any algorithm that examines equilibria involving fewer than logn strategies [Alt94]. We give a simple, linear-time algorithm examining just two strategie...
متن کاملA note on Bayesian Nash equilibria in imperfectly discriminating contests
The literature on imperfectly discriminating contests has almost exclusively focused on complete information. We study such contests assuming players have private information. We identify a general class of imperfectly discriminating contests for which findings by Athey (2001) imply the existence of a Bayesian Nash equilibrium in monotone pure strategies. The main assumptions are that a player’...
متن کاملOn Cournot - Nash Equilibria with Exogenous Uncertainty
A large body of literature has accumulated which examines how the optimal solution of an agent maximizing the expectation of a real-valued function, depending on a random parameter p and the agent's behavior x, reacts to perturbations in the first and second moments of p. Here, by an approximation valid for small uncertainty, we allow many agents and consider their behavior in a Cournot-Nash eq...
متن کاملOn Algorithms for Nash Equilibria
We present a progress report on ongoing research in algorithms for finding sample Nash equilibria of two-player matrix games. We present a combination of background material, new results, and promising directions for further study. Our new results include a reduction from general games to {0, 1} games, a relation between the complexity of finding Nash equilibria and program obfuscation, and a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2014
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/2014001